Randomness Representation of Turbulence in Canopy Flows Using Kolmogorov Complexity Measures
نویسندگان
چکیده
Turbulence is often expressed in terms of either irregular or random fluid flows, without quantification. In this paper, a methodology to evaluate the randomness of the turbulence using measures based on the Kolmogorov complexity (KC) is proposed. This methodology is applied to experimental data from a turbulent flow developing in a laboratory channel with canopy of three different densities. The methodology is even compared with the traditional approach based on classical turbulence statistics.
منابع مشابه
Kolmogorov Complexity and Algorithmic Randomness
This paper aims to provide a minimal introduction to algorithmic randomness. In particular, we cover the equivalent 1-randomness and MartinLöf randomness. After a brief review of relevant concepts in computability, we develop the basic theory of Kolmogorov complexity, including the KC theorem and more general notion of information content measures. We then build two natural definitions of rando...
متن کاملIs Randomness native to Computer Science? Ten Years Later
2 What we have learned? A personal pick 4 2.1 From randomness to complexity . . . . . . . . . . . . . . . . . . . . . 4 2.2 Formalization of randomness: infinite strings . . . . . . . . . . . . . 5 2.3 Random versus lawless . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.4 Randomness and finite strings: incompressibility . . . . . . . . . . . 7 2.5 Representation and Kolmogorov complexi...
متن کاملRandomness with Respect to the Signed-Digit Representation
The ordinary notion of algorithmic randomness of reals can be characterised as MartinLöf randomness with respect to the Lebesgue measure or as Kolmogorov randomness with respect to the binary representation. In this paper we study the question how the notion of algorithmic randomness induced by the signed-digit representation of the real numbers is related to the ordinary notion of algorithmic ...
متن کاملQuantum Kolmogorov Complexity
In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the string. We define the quantum Kolmogorov complexity of a qubit string as the length of the short...
متن کاملPossibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled using probability distributions and min-entropy to measure their quality and also by using individual strings and Kolmogorov complexity to measure their quality. Complexity theorists are more familiar with the first ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Entropy
دوره 19 شماره
صفحات -
تاریخ انتشار 2017